Inverted indexes and multi-list structures

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inverted indexes: Types and techniques

There has been a s ubstantial amount of research on high performance inverted index because most web and search engines use an inverted index to execute queries. Documents are normally stored as lists of words, but inverted indexes invert this by storing for each word the list of documents that the word appears in, hence the name “inverted index”. This paper presents the crucial research findin...

متن کامل

Phrase Queries with Inverted + Direct Indexes

Phrase queries play an important role in web search and other applications. Traditionally, phrase queries have been processed using a positional inverted index, potentially augmented by selected multiword sequences (e.g., n-grams or frequent noun phrases). In this work, instead of augmenting the inverted index, we take a radically different approach and leverage the direct index, which provides...

متن کامل

GRAB - Inverted Indexes with Low Storage Overhead

A searching command (grab) for maintaining indexes combines acceptably fast searching with very low storage overhead. It looks like grep except that it demands a preindexing pass, looks only for whole words, and runs faster. As an example of performance, consider the time to search for single words in a 7.8 Mbyte file (the Brown corpus of English). The times below are in seconds on a DEC 8600 r...

متن کامل

Fast Inverted Indexes with On-Line Update

Charles L. A. Clarke Gordon V. Cormack Forbes J. Burkowski Dept. of Computer Science University of Waterloo, Waterloo, Canada, N2L 3G1 Technical Report CS-94-40 November 23, 1994 Abstract We describe data structures and an update strategy for the practical implementation of inverted indexes. The context of our discussion is the construction of a dedicated index engine for a distributed full-tex...

متن کامل

Taming Hot-Spots in DHT Inverted Indexes

DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency expects a level of uniformity in the association of data to index keys that is often not present in inverted indexes. Index data tends to follow nonuniform distributions, often power law distributions, creating intense local storag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1974

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/17.1.59